Dantzig-wolfe Decomposition and Large-scale Constrained Mpc Problems

نویسندگان

  • Ruoyu Cheng
  • J. Fraser Forbes
چکیده

Model Predictive Control (MPC) strategies are typically implemented in two levels: a steady-state target calculation and a control calculation. The steady-state target calculation consumes excess degrees of freedom within the control problem to provide optimal steady-state performance with respect to some specified objective. In some MPC approaches, the target calculation is formulated as a Linear Program (LP) with a pre-specified objective function and a linear or linearized steady-state model derived from that used in the control calculation. In large-scale problems, centralized MPC schemes find the optimal solution for the plant-wide optimization problem, but may not provide sufficient redundancy or reliability and can require substantial computation. On the other hand, in a decentralized MPC scheme, the target calculations are performed independently by ignoring interactions among units, and as a result will not usually find the optimal operation. In contrast to the centralized MPC approach, a decentralized MPC provides a high degree of redundancy with respect to the failure of an individual MPC. For largescale process control problems, the desired characteristics for an MPC implementation include: accurate and quick tracking of the changing optimal steady-state operation, a high degree of reliability with respect to failure within the MPC application (i.e., failure of a portion of the control system), and low computational requirements. Fully centralized or monolithic MPC and independent block-wise decentralized MPC represent the two extremes in the “trade-off” among the desired characteristics of an implemented MPC system. In this paper, we propose a coordinated, decentralized approach to the steady-state target calculation problem. Our approach is based on the Dantzig-Wolfe decomposition principle and has been found to be effective at finding the optimal plant operation while providing a high degree of reliability at a reasonable computational load.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dantzig-Wolfe Decomposition Algorithm for Linear Economic MPC of a Power Plant Portfolio

Future power systems will consist of a large number of decentralized power producers and a large number of controllable power consumers in addition to stochastic power producers such as wind turbines and solar power plants. Control of such large scale systems requires new control algorithms. In this paper, we formulate the control of such a system as an Economic Model Predictive Control (MPC) p...

متن کامل

A Dantzig-Wolfe Decomposition Algorithm for Economic MPC of Distributed Energy Systems

In economic model predictive control of distributed energy systems, the constrained optimal control problem can be expressed as a linear program with a block-angular structure. In this paper, we present an efficient Dantzig-Wolfe decomposition algorithm specifically tailored to problems of this type. Simulations show that a MATLAB implementation of the algorithm is significantly faster than sev...

متن کامل

A Reduced Dantzig-Wolfe Decomposition for a Suboptimal Linear MPC

Linear Model Predictive Control (MPC) is an efficient control technique that repeatedly solves online constrained linear programs. In this work we propose an economic linear MPC strategy for operation of energy systems consisting of multiple and independent power units. These systems cooperate to meet the supply of power demand by minimizing production costs. The control problem can be formulat...

متن کامل

A Computational Study of Dantzig-Wolfe Decomposition

A Computational Study of Dantzig-Wolfe Decomposition James Richard Tebboth This thesis evaluates the computational merits of the Dantzig-Wolfe decomposition algorithm. We use modern computer hardware and software, and, in particular, we have developed an efficient parallel implementation of Dantzig-Wolfe decomposition. We were able to solve problems of up to 83,500 rows, 83,700 columns, and 622...

متن کامل

Interior Point Methods with Decomposition for Solving Large Scale Linear Programs

This paper deals with an algorithm incorporating the interior point method into the Dantzig-Wolfe decomposition technique for solving large-scale linear programming problems. The algorithm decomposes a linear program into a main problem and a subprob-lem. The subproblem is solved approximately. Hence, inexact Newton directions are used in solving the main problem. We show that the algorithm is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004